Computational experiences on the distances of polynomials to irreducible polynomials
نویسندگان
چکیده
In this paper we deal with a problem of Turán concerning the ‘distance’ of polynomials to irreducible polynomials. Using computational methods we prove that for any monic polynomial P ∈ Z[x] of degree ≤ 22 there exists a monic polynomial Q ∈ Z[x] with deg(Q) = deg(P ) such that Q is irreducible over Q and the ‘distance’ of P and Q is ≤ 4.
منابع مشابه
Symmetry classes of polynomials associated with the dihedral group
In this paper, we obtain the dimensions of symmetry classes of polynomials associated with the irreducible characters of the dihedral group as a subgroup of the full symmetric group. Then we discuss the existence of o-basis of these classes.
متن کاملSome results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملSolving singular integral equations by using orthogonal polynomials
In this paper, a special technique is studied by using the orthogonal Chebyshev polynomials to get approximate solutions for singular and hyper-singular integral equations of the first kind. A singular integral equation is converted to a system of algebraic equations based on using special properties of Chebyshev series. The error bounds are also stated for the regular part of approximate solut...
متن کاملBrenstien polynomials and its application to fractional differential equation
The paper is devoted to the study of Brenstien Polynomials and development of some new operational matrices of fractional order integrations and derivatives. The operational matrices are used to convert fractional order differential equations to systems of algebraic equations. A simple scheme yielding accurate approximate solutions of the couple systems for fractional differential equations is ...
متن کاملA solution for Volterra Integral Equations of the First Kind Based on Bernstein Polynomials
In this paper, we present a new computational method to solve Volterra integral equations of the first kind based on Bernstein polynomials. In this method, using operational matrices turn the integral equation into a system of equations. The computed operational matrices are exact and new. The comparisons show this method is acceptable. Moreover, the stability of the proposed method is studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 66 شماره
صفحات -
تاریخ انتشار 1997